Stratified sampling and quasi-Monte Carlo simulation

نویسنده

  • G. Leobacher
چکیده

We provide a method for the generation of paths of Lévy processes which has many of the benefits that the Brownian bridge construction has for Brownian motion. We show how, using our method, one can apply stratified sampling and quasi-Monte Carlo methods to obtain better numerical schemes analog to the Brownian case. As a numerical example we consider the problem of pricing an asian option in the so-called hyperbolic market model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Methods and Parallelism into Monte Carlo Simulation

This paper provides an updated review of Monte Carlo simulation. The use of random sampling, its consequences in simulation, the use of descriptive sampling, its advantages, its limits and its improvement upon the precision of simulation estimates: Refined descriptive sampling. This state of the art gives also an insight into other sampling procedures used in the literature, like Ranked set sam...

متن کامل

An Empirical Evaluation of Sampling Methods in Risk Analysis Simulation: Quasi-monte Carlo, Descriptive Sampling, and Latin Hypercube Sampling

This paper compares the performance, in terms of convergence rates and precision of the estimates, for six Monte Carlo Simulation sampling methods: Quasi-Monte Carlo using Halton, Sobol, and Faure numeric sequences; Descriptive Sampling, based on the use of deterministic sets and Latin Hypercube Sampling, based on stratified numerical sets. Those methods are compared to the classical Monte Carl...

متن کامل

Quasi-monte Carlo Strategies for Stochastic Optimization

In this paper we discuss the issue of solving stochastic optimization problems using sampling methods. Numerical results have shown that using variance reduction techniques from statistics can result in significant improvements over Monte Carlo sampling in terms of the number of samples needed for convergence of the optimal objective value and optimal solution to a stochastic optimization probl...

متن کامل

Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

متن کامل

Quasi-Monte Carlo sampling to improve the efficiency of Monte Carlo EM

In this paper we investigate an efficient implementation of the Monte Carlo EM algorithm based on Quasi-Monte Carlo sampling. The Monte Carlo EM algorithm is a stochastic version of the deterministic EM (Expectation-Maximization) algorithm in which an intractable E-step is replaced by a Monte Carlo approximation. Quasi-Monte Carlo methods produce deterministic sequences of points that can signi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005